Balanced Constraint Measure Algorithm to Preserve Privacy from Sequential Rule Discovery
نویسندگان
چکیده
Preservation of needed privacy from mining algorithms (data mining methods which extract information from the privacy diffusion of people and organizations) is an emerging research area. Researchers are creating procedures to maintain a proper balance between maintaining information privacy and knowledge discovery by using data mining. In this paper, we initially use the prefixspan algorithm to generate sequential patterns from the medical database, and these patterns are converted into sequential rules. We then apply our proposed algorithm to evaluate these generated sequential rules according to random values. Our proposed algorithm evaluates the processed rule in terms of knowledge discovery and information loss. If the evaluated result satisfies the user-defined thresholds, our proposed algorithm releases the modified sequential rules, else further iteration is carried out until the sequential rules satisfy the user-defined threshold value. Finally, an experiment is conducted to evaluate the proposed algorithm on the basis of knowledge discovery and information loss. Key-Words: Prefix span algorithm, Sequential rule, Significant disease, Balanced constraint, Knowledge discovery, Information loss
منابع مشابه
Introducing an algorithm for use to hide sensitive association rules through perturb technique
Due to the rapid growth of data mining technology, obtaining private data on users through this technology becomes easier. Association Rules Mining is one of the data mining techniques to extract useful patterns in the form of association rules. One of the main problems in applying this technique on databases is the disclosure of sensitive data by endangering security and privacy. Hiding the as...
متن کاملA privacy-preserving algorithm for distributed constraint optimization
Distributed constraint optimization problems enable the representation of many combinatorial problems that are distributed by nature. An important motivation for such problems is to preserve the privacy of the participating agents during the solving process. The present paper introduces a novel privacy-preserving algorithm for this purpose. The proposed algorithm requires a secure solution of s...
متن کاملP-SyncBB: A Privacy Preserving Branch and Bound DCOP Algorithm
Distributed constraint optimization problems enable the representation of many combinatorial problems that are distributed by nature. An important motivation for such problems is to preserve the privacy of the participating agents during the solving process. The present paper introduces a novel privacy-preserving branch and bound algorithm for this purpose. The proposed algorithm, P-SyncBB, pre...
متن کاملImproved Univariate Microaggregation for Integer Values
Privacy issues during data publishing is an increasing concern of involved entities. The problem is addressed in the field of statistical disclosure control with the aim of producing protected datasets that are also useful for interested end users such as government agencies and research communities. The problem of producing useful protected datasets is addressed in multiple computational priva...
متن کاملUtilitarian Approach to Privacy in Distributed Constraint Optimization Problems
Privacy has been a major motivation for distributed problem optimization. However, even though several methods have been proposed to evaluate it, none of them is widely used. The Distributed Constraint Optimization Problem (DCOP) is a fundamental model used to approach various families of distributed problems. Here we approach the problem by letting both the optimized costs found in DCOPs and t...
متن کامل